00100		Work on  representation  theory  continues  along  the  lines
00200	described in the previous proposal.  Recent developments include work
00300	performed during a visit to Stanford by  Erik  Sandewall  of  Uppsala
00400	University  on  expressing  natural language information in predicate
00500	calculus and work by McCarthy on languages in which not all sentences
00600	have truth values.  Recent work in mathematical theory of computation
00700	by McCarthy,  Ashcroft,  and  Manna  on  parallel  and  indeterminate
00800	computations and the correctness of non-halting programs has a direct
00900	application to representation theory because  it  permits  proofs  of
01000	correctness  of strategies while processes other than the activity of
01100	the machine are going on.  The proof checker  development  under  the
01200	Mathematical Theory of Computation project will also promote this.
01300	
01400		In  the  next  period,  work in representation theory will be
01500	carried out by McCarthy, Patrick Hayes, possibly David  Luckham,  and
01600	by graduate students.